Algorithms Lecture 0: Introduction [Sp’14] Hinc incipit algorismus. Haec algorismus ars praesens dicitur in qua

Source URL: web.engr.illinois.edu

• Analysis of algorithms
• Algorithm
• Mathematical logic
• Multiplication algorithm
• Time complexity
• Stable marriage problem
• Stability
• Euclidean algorithm
• CYK algorithm
• Theoretical computer science
• Mathematics
• Applied mathematics

16th Canadian Conference on Computational Geometry, 2004 An Average Running Time Analysis of a Backtracking Algorithm to Calculate the Measure of the Union of Hyperrectangles in Dimensions Susumu Suzuki

Source URL: www.cccg.ca

• Operations research
• NP-complete problems
• Search algorithms
• Analysis of algorithms
• Boolean satisfiability problem
• Backtracking
• Algorithm
• PP
• Time complexity
• Theoretical computer science
• Applied mathematics
• Computational complexity theory

PIF - Payroll integration framework In almost every organization Time & Attendance data is used directly or indirectly for Payroll calculation. Yet, the level and complexity of integration

Source URL: www.spica.com

Amortization Algorithms Lecture 15: Amortized Analysis [Fa’13]

Source URL: web.engr.illinois.edu

• Computer science
• Amortized analysis
• Potential method
• Stack
• Accounting method
• Time complexity
• Gray code
• Heap
• Bit array
• Theoretical computer science
• Analysis of algorithms
• Mathematics

CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 A Constant-Factor Approximation for Maximum Weight Triangulation Shiyan Hu∗

Source URL: www.cccg.ca

• Applied mathematics
• Minimum-weight triangulation
• Minimum spanning tree
• Dynamic programming
• Time complexity
• Delaunay triangulation
• Point set triangulation
• Triangulation
• Theoretical computer science
• Mathematics

1 Complexity of Algorithms Lecture Notes, SpringPeter G´acs

Source URL: www.cs.elte.hu

• Complexity classes
• Analysis of algorithms
• Probabilistic complexity theory
• Computational resources
• NP
• Time complexity
• P
• Randomized algorithm
• Theory of computation
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

CS 373 Midterm 1 Questions (February 20, 2001) Spring 2001

Source URL: web.engr.illinois.edu

• Binary trees
• Analysis of algorithms
• Sorting algorithms
• Computational complexity theory
• Skip list
• Time complexity
• Splay tree
• Treap
• Quicksort
• Theoretical computer science
• Applied mathematics
• Mathematics

Parameterized Approximation via Fidelity Preserving Transformations Michael R. Fellows1 , Ariel Kulik2 , Frances Rosamond1 , and Hadas Shachnai3? 1 School of Engineering and IT, Charles Darwin Univ., Darwin, NT Australi

Source URL: www.cs.technion.ac.il

• NP-complete problems
• Analysis of algorithms
• Parameterized complexity
• Graph coloring
• Kernelization
• Dominating set
• Vertex cover
• Time complexity
• Steiner tree problem
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

On k-Enclosing Objects in a Coloured Point Set Luis Barba∗ Stephane Durocher†‡ Debajyoti Mondal†

Source URL: www.cccg.ca

• Discrete mathematics
• Computational geometry
• Diagrams
• Voronoi diagram
• Proximity problems
• Time complexity
• Largest empty rectangle
• Smallest circle problem
• Mathematics
• Theoretical computer science
• Discrete geometry

Improved Spectral Sparsification and Numerical Algorithms for SDD Matrices Ioannis Koutis1 , Alex Levin2 , and Richard Peng3 1 Computer Science Department, University of Puerto Rico, Río Piedras

Source URL: ccom.uprrp.edu

• Analysis of algorithms
• NP-complete problems
• Probabilistic complexity theory
• Randomized algorithm
• Minor
• SL
• Degree
• Graph partition
• Time complexity
• Theoretical computer science
• Graph theory
• Computational complexity theory